Properties of regular systems and algorithmic improvements for regular decomposition

Algorithmic Improvements in Regular Model Checking

An Algorithmic Approach for Checking Closure Properties of !-Regular Languages

In concurrency theory, there are several examples where the interleaved model of concurrency can distinguish between execution sequences which are not signiicantly diierent. One such example is sequences that diier from each other by stuttering, i. e., the number of times a state can adjacently repeat. Another example is executions that diier only by the ordering of independently executed event...

The decomposition of the regular asynchronous systems as parallel connection of regular asynchronous systems

The asynchronous systems are the non-deterministic models of the asynchronous circuits from the digital electrical engineering, where non-determinism is a consequence of the fact that modelling is made in the presence of unknown and variable parameters. Such a system is a multi-valued function f that assigns to an (admissible) input u : R! f0; 1gm a set f(u) of (possible) states x : R! f0; 1gn:...

Regular cylindrical algebraic decomposition

We show that a strong well-based cylindrical algebraic decomposition P of a bounded semi-algebraic set is a regular cell decomposition, in any dimension and independently of the method by which P is constructed. Being well-based is a global condition on P that holds for the output of many widely used algorithms. We also show the same for S of dimension at most 3 and P a strong cylindrical algeb...

Some properties of the regular asynchronous systems

The asynchronous systems are the models of the asynchronous circuits from the digital electrical engineering. An asynchronous system f is a multi-valued function that assigns to each admissible input u : R → {0, 1}m a set f(u) of possible states x ∈ f(u), x : R → {0, 1}n. A special case of asynchronous system consists in the existence of a Boolean function Υ : {0, 1}n × {0, 1}m → {0, 1}n such t...